作者： Kai Xing; Shuo Zhang; Lei Shi; Haojin Zhu; Yuepeng Wang

发表刊物：2013 Infocom

年份：14-19 April 2013

摘要：In this paper we propose and analyze a localized backbone renovating algorithm (LBR) to renovate a broken backbone in the network. This research is motivated by the problem of virtual backbone maintenance in wireless ad hoc and sensor networks, where the coverage area of nodes are disks with identical radii. According to our theoretical analysis, the proposed algorithm has the ability to renovate the backbone in a purely localized manner with a guaranteed connectivity of the network, while keeping the backbone size within a constant factor from that of the minimum CDS. Both the communication overhead and computation overhead of the LBR algorithm are O(k), where k is the number of nodes broken or added. We also conduct extensive simulation study on connectivity, backbone size, and the communication/computation overhead. The simulation results show that the proposed algorithm can always keep the renovated backbone being connected at low communication/computation overhead with a relatively small backbone, compared with other existing schemes. Furthermore, the LBR algorithm has the ability to deal with arbitrary number of node failures and additions in the network.

参考文献拷贝字段：Kai Xing, Shuo Zhang, Lei Shi, Haojin Zhu, Yuepeng Wang. A localized backbone renovating algorithm for wireless ad hoc and sensor networks . IEEE Infocom, Turin, April 14-19, 2013: 2184-2192.